Observations on determinization of Büchi automata
نویسندگان
چکیده
منابع مشابه
Observations on Determinization of Büchi Automata
The two determinization procedures of Safra and MullerSchupp for Büchi automata are compared, based on an implementation in a program called OmegaDet.
متن کامل3 Determinization of Büchi -
To determinize Büchi automata it is necessary to switch to another class of ω-automata, e.g. Muller or Rabin automata. The reason is that there exist languages which are accepted by some nondeterministic Büchi-automaton, but not by any deterministic Büchi-automaton (c.f. section 3.1). The history of constructions for determinizing Büchi automata is long: it starts in 1963 with a faulty construc...
متن کاملProfile Trees for Büchi Word Automata, with Application to Determinization
The determinization of Büchi automata is a celebrated problem, with applications in synthesis, probabilistic verification, and multi-agent systems. Since the 1960s, there has been a steady progress of constructions: by McNaughton, Safra, Piterman, Schewe, and others. Despite the proliferation of solutions, they are all essentially ad-hoc constructions, with little theory behind them other than ...
متن کاملA Modular Approach for Büchi Determinization
The problem of Büchi determinization is a fundamental problem with important applications in reactive synthesis, multi-agent systems and probabilistic verification. The first asymptotically optimal Büchi determinization (a.k.a the Safra construction), was published in 1988. While asymptotically optimal, the Safra construction is notorious for its technical complexity and opaqueness in terms of ...
متن کاملDeterminization of Parity automata
A central result in the theory of ω-automata is McNaughton's Theorem which states that every Buchi automaton is equivalent to a deterministic Muller automaton. The complexity of McNaughton's algorithm is huge. Safra provided an optimal construction. Safra's algorithm converts a Buchi automaton with n states to a deterministic Rabin automaton with n states. Much e orts have been invested to redu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.07.026